Optimum QAM - TCM Schemes Using Left - Circulate Function over GF ( 2 N )

نویسندگان

  • Călin Vlădeanu
  • Safwan El Assad
چکیده

In this paper, quadrature amplitude modulation – trellis coded modulation (QAM-TCM) schemes are designed using recursive convolutional (RC) encoders over Galois field GF(2 N ). These encoders are designed using the nonlinear leftcirculate (LCIRC) function. The LCIRC function performs a bit left circulation over the representation word. Different encoding rates are obtained for these encoders when using different representation wordlengths at the input and the output, denoted as Nin and N, respectively. A generalized 1delay GF(2 N ) RC encoder scheme using LCIRC is proposed for performance analysis and optimization, for any possible encoding rate, Nin/N. The minimum Euclidian distance is estimated for these QAM-TCM schemes and a general expression is found as a function of the wordlengths Nin and N. The symbol error rate (SER) is estimated by simulation for QAM-TCM transmissions over an additive white Gaussian noise (AWGN) channel. The proposed encoders outperform the corresponding binary encoders in terms of structural complexity and the availability of a general expression for the Euclidian distance. Keywords-Recursive convolutional GF(2 N ) encoders; Leftcirculate function; QAM-TCM.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recursive Gf(2) Encoders Using Left-circulate Function for Optimum Tcm Schemes

In this paper, trellis coded modulation (TCM) schemes are designed using recursive encoders over Galois field GF(2). These encoders are designed using the nonlinear left-circulate (LCIRC) function. The LCIRC function performs a bit left circulation over the representation word. Different encoding rates are obtained for these encoders when using different representation word lengths at the input...

متن کامل

Optimum GF(2N) encoders using left-circulate function for PSK-TCM schemes

In this paper, phase shift keying – trellis coded modulation (PSK-TCM) schemes are designed using recursive systematic convolutional (RSC) encoders over Galois field GF(2 N ). These encoders are designed using the nonlinear leftcirculate (LCIRC) function. The LCIRC function performs a bit left circulation over the representation word. Different encoding rates are obtained for these encoders whe...

متن کامل

Punctured 8-PSK Turbo-TCM transmissions using recursive systematic convolutional GF(2N) encoders

A new Galois field GF ( 2 ) structure for designing recursive systematic convolutional (RSC) encoders is presented in this article. The proposed RSC encoders are used as components of a parallel-concatenated Turbo trellis coded modulation (TTCM) scheme. The GF ( 2 ) RSC encoders include a nonlinear function named leftcirculate (LCIRC), which is performing a left circulation over the N bits repr...

متن کامل

Error Performance Analysis of a Concatenated Coding Scheme with 64/256-QAM Trellis Coded Modulation for the North American Cable Modem Standard

In this paper, concatenated coding schemes with Reed-Solomon (RS) coding in the outer stage and trellis coded modulation (TCM) in the inner stage are analyzed. The TCM decoder incorporates a Viterbi decoder compliant with ITU-T Recommendation J.83, Annex B (North American digital video transmission specifications for Multimedia Cable Network System (MCNS)). The module is suitable as the inner s...

متن کامل

Optimized signal constellations for trellis-coded modulation on AWGN channels

NGERBOECK’S trellis-coded modulation (TCM) schemes [1]-[3] use the symmetries of rate n/ (n + 1) binary convolutional codes to map the channel symbols onto the trellis. The channel symbols are selected from the pulse amplitude modulation (PAM), phase shift keying (PSK), or quadrature amplitude modulation (QAM) signal constellations that are also used for uncoded modulation. In [4] and [SI, howe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011